◀ Prev · Parts · Full · Next ▶

cite-note-2-2323. ↑ "Lecture Notes, Chapter 3. Basic Derandomization Techniques". people.seas.harvard.edu. Retrieved 2024-12-27.

cite-note-2424. ↑ citerefchazellefriedman1990Chazelle, B.; Friedman, J. (1990-09-01). "A deterministic view of random sampling and its use in geometry". Combinatorica. 10 (3): 229–249. doi:10.1007/BF02122778. ISSN 1439-6912.

cite-note-2525. ↑ citerefalippi2014Alippi, Cesare (2014), Intelligence for Embedded Systems, Springer, ISBN 978-3-319-05278-6.

cite-note-2626. ↑ citerefkushilevitznisan2006Kushilevitz, Eyal; Nisan, Noam (2006), Communication Complexity, Cambridge University Press, ISBN 9780521029834. For the deterministic lower bound see p. 11; for the logarithmic randomized upper bound see pp. 31–32.

cite-note-2727. ↑ citerefdyerfriezekannan1991Dyer, M.; Frieze, A.; Kannan, R. (1991), "A random polynomial-time algorithm for approximating the volume of convex bodies" (PDF), Journal of the ACM, 38 (1): 1–17, doi:10.1145/102782.102783, S2CID 13268711

◀ Prev · Parts · Full · Next ▶